(ε− α)−MCMC-Approximation under Drift Condition

نویسندگان

  • Krzysztof à Latuszyński
  • Wojciech Niemiro
چکیده

An essential part of many problems encountered in Bayesian inference is the computation of analytically intractable integral I = πf = ∫ X f(x)π(x)dx, where f(x) is the target function of interest, X is often a region in high-dimensional space and the probability distribution π over X is usually known up to a normalizing constant and direct simulation from π is not feasible. The classical MCMC approach to this problem is to generate an ergodic Markov chain (Xn)n≥0, using a transition kernel P , with stationary distribution π, which ensures convergence of L(Xn) to π and then estimate I by averages along a single trajectory i.e. by taking

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Rigorous confidence bounds for MCMC under a geometric drift condition

interest and Ît,n = (1/n) ∑t+n−1 i=t f(Xi) its MCMC estimate. Precisely, we derive lower bounds for the length of the trajectory n and burn-in time t which ensure that P (|Ît,n − I| ≤ ε) ≥ 1− α. The bounds depend only and explicitly on drift parameters, on the V−norm of f, where V is the drift function and on precision and confidence parameters ε, α. Next we analyse an MCMC estimator based on t...

متن کامل

Simultaneous drift conditions for Adaptive Markov Chain Monte Carlo algorithms

In the paper, we mainly study ergodicity of adaptive MCMC algorithms. Assume that under some regular conditions about target distributions, all the MCMC samplers in {Pγ : γ ∈ Y} simultaneously satisfy a group of drift conditions, and have the uniform small set C in the sense of the m-step transition such that each MCMC sampler converges to target at a polynomial rate. We say that the family {Pγ...

متن کامل

Underdamped Langevin MCMC: A non-asymptotic analysis

We study the underdamped Langevin diffusion when the log of the target distribution is smooth and strongly concave. We present a MCMC algorithm based on its discretization and show that it achieves ε error (in 2-Wasserstein distance) in O( √ d/ε) steps. This is a significant improvement over the best known rate for overdamped Langevin MCMC, which is O(d/ε) steps under the same smoothness/concav...

متن کامل

Convergence of Adaptive Markov Chain Monte Carlo Algorithms

In the thesis, we study ergodicity of adaptive Markov Chain Monte Carlo methods (MCMC) based on two conditions (Diminishing Adaptation and Containment which together imply ergodicity), explain the advantages of adaptive MCMC, and apply the theoretical result for some applications. First we show several facts: 1. Diminishing Adaptation alone may not guarantee ergodicity; 2. Containment is not ne...

متن کامل

Clustering with or without the Approximation

We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input for the clustering problem consists of points in a metric space and a number k, specifying the desired number of clusters. The algorithms find a clustering that is provably close to a target clustering, provided that the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006